Locally Linear Time Temporal Logic

نویسنده

  • Ramaswamy Ramanujam
چکیده

We study linear time temporal logics of multiple agents, where the temporal modalities are local. These modalities not only refer to local next-instants and local eventuality, but also global views of agents at any local instant, which are updated due to communication from other agents. Thus agentsalso reason about the future, present and past of other agents in the system. The models for these logics are simple : runs of networks of synchronizing automata. Problems like gossipping in interconnection networks are naturally described in the logics proposed here. We present solutions to the satisfiability and model checking problems for these logics. Further, since formulas are insensitive to different interleavings of runs, partial order based verification methods become applicable for properties described in these logics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces

To obtain an expressively complete linear-time temporal logic (LTL) over Mazurkiewicz traces that is computationally tractable, we need to intepret formulas locally, at individual events in a trace, rather than globally, at configurations. Such local logics necessarily require past modalities, in contrast to the classical setting of LTL over sequences. Earlier attempts at defining expressively ...

متن کامل

LTL receding horizon control for finite deterministic systems

This paper considers receding horizon control of finite deterministic systems, which must satisfy a high level, rich specification expressed as a linear temporal logic formula. Under the assumption that timevarying rewards are associated with states of the system and these rewards can be observed in real-time, the control objective is tomaximize the collected rewardwhile satisfying the high lev...

متن کامل

Diagonal arguments and fixed points

‎A universal schema for diagonalization was popularized by N.S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fi...

متن کامل

Natural Deduction Calculus for Quantified Propositional Linear-time Temporal Logic. Technical Report

We present a natural deduction calculus for the quantified propositional linear-time temporal logic (QPTL) and prove its correctness. The system extends previous natural deduction constructions for the propositional linear-time temporal logic. These developments extend the applicability of the natural deduction to more sophisticated specifications due to the expressive power of QPTL and, on the...

متن کامل

Propositional Temporal Linear Logic and its Application to Concurrent Systems

In computer science, concepts of resource such as data consumption and of time such as execution time are very important. Logical systems which can treat them have been applied in that field. Linear logic has been called a resource conscious logic. The expressive power is enough to describe a dynamic change in process environments. However, linear logic is not enough to treat a dynamic change i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996